A Primal-Dual Approach for a Total Variation Wasserstein Flow
نویسندگان
چکیده
We consider a nonlinear fourth-order diffusion equation that arises in denoising of image densities. We propose an implicit timestepping scheme that employs a primal-dual method for computing the subgradient of the total variation semi-norm. The constraint on the dual variable is relaxed by adding a penalty term, depending on a parameter that determines the weight of the penalisation. The paper is furnished with some numerical examples showing the denoising properties of the model considered.
منابع مشابه
Primal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کاملABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملAn Efficient Primal-Dual Hybrid Gradient Algorithm For Total Variation Image Restoration
We propose a simple yet efficient algorithm for total variation (TV) minimizations with applications in the image processing realm. This descent-type algorithm alternates between the primal and dual formulations and exploit the information from both the primal and dual variables. It converges significantly faster than some popular existing methods as demonstrated in our experiments. This approa...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملLearning to solve inverse problems using Wasserstein loss
We propose using the Wasserstein loss for training in inverse problems. In particular, we consider a learned primal-dual reconstruction scheme for ill-posed inverse problems using the Wasserstein distance as loss function in the learning. This is motivated by miss-alignments in training data, which when using standard mean squared error loss could severely degrade reconstruction quality. We pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013